0.04/0.08 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.08/0.28 % Computer : n006.cluster.edu 0.08/0.28 % Model : x86_64 x86_64 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.28 % Memory : 8042.1875MB 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.28 % CPULimit : 1920 0.08/0.28 % WCLimit : 240 0.08/0.28 % DateTime : Wed Jul 30 03:06:04 EDT 2025 0.08/0.28 % CPUTime : 0.13/0.38 Running higher-order theorem proving 0.13/0.38 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.BjUFjak5SO/E---3.1_2320.p 41.07/5.61 # Version: 3.0.0-ho 41.07/5.61 # Preprocessing class: HSSSSMSSSSSNHHA. 41.07/5.61 # Scheduled 5 strats onto 8 cores with 240 seconds (1920 total) 41.07/5.61 # Starting sh2lt with 960s (4) cores 41.07/5.61 # Starting new_ho_10_unif with 240s (1) cores 41.07/5.61 # Starting full_lambda_6 with 240s (1) cores 41.07/5.61 # Starting post_as_ho1 with 240s (1) cores 41.07/5.61 # Starting ehoh_best3_rw with 240s (1) cores 41.07/5.61 # ehoh_best3_rw with pid 2402 completed with status 0 41.07/5.61 # Result found by ehoh_best3_rw 41.07/5.61 # Preprocessing class: HSSSSMSSSSSNHHA. 41.07/5.61 # Scheduled 5 strats onto 8 cores with 240 seconds (1920 total) 41.07/5.61 # Starting sh2lt with 960s (4) cores 41.07/5.61 # Starting new_ho_10_unif with 240s (1) cores 41.07/5.61 # Starting full_lambda_6 with 240s (1) cores 41.07/5.61 # Starting post_as_ho1 with 240s (1) cores 41.07/5.61 # Starting ehoh_best3_rw with 240s (1) cores 41.07/5.61 # SinE strategy is gf120_gu_RUU_F100_L01000 41.07/5.61 # Search class: HGHNF-FFSF22-SHHFFSBN 41.07/5.61 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 41.07/5.61 # Starting new_ho_10_unif with 72s (1) cores 41.07/5.61 # new_ho_10_unif with pid 2410 completed with status 0 41.07/5.61 # Result found by new_ho_10_unif 41.07/5.61 # Preprocessing class: HSSSSMSSSSSNHHA. 41.07/5.61 # Scheduled 5 strats onto 8 cores with 240 seconds (1920 total) 41.07/5.61 # Starting sh2lt with 960s (4) cores 41.07/5.61 # Starting new_ho_10_unif with 240s (1) cores 41.07/5.61 # Starting full_lambda_6 with 240s (1) cores 41.07/5.61 # Starting post_as_ho1 with 240s (1) cores 41.07/5.61 # Starting ehoh_best3_rw with 240s (1) cores 41.07/5.61 # SinE strategy is gf120_gu_RUU_F100_L01000 41.07/5.61 # Search class: HGHNF-FFSF22-SHHFFSBN 41.07/5.61 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 41.07/5.61 # Starting new_ho_10_unif with 72s (1) cores 41.07/5.61 # Preprocessing time : 0.001 s 41.07/5.61 # Presaturation interreduction done 41.07/5.61 41.07/5.61 # Proof found! 41.07/5.61 # SZS status Theorem 41.07/5.61 # SZS output start CNFRefutation 41.07/5.61 thf(decl_sort1, type, a: $tType). 41.07/5.61 thf(decl_23, type, epred1_0: a > a > $o). 41.07/5.61 thf(decl_24, type, esk1_0: (a > $o) > a). 41.07/5.61 thf(decl_25, type, esk2_2: (a > $o) > a > a). 41.07/5.61 thf(decl_26, type, esk3_0: a > a). 41.07/5.61 thf(cTHM145L_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a, X4:a, X5:a]:(((X1 @ X3 @ X5)<=((X1 @ X3 @ X4)&(X1 @ X4 @ X5))))&![X6:a > $o]:((![X7:a]:((![X8:a]:(((X1 @ X8 @ X7)<=(X6 @ X8)))=>(X1 @ (X2 @ X6) @ X7)))&![X5:a]:(((X6 @ X5)=>(X1 @ X5 @ (X2 @ X6)))))))=>![X9:a > a]:((?[X10:a]:(((X1 @ (X9 @ X10) @ X10)&(X1 @ X10 @ (X9 @ X10))))<=![X3:a, X4:a]:(((X1 @ X3 @ X4)=>(X1 @ (X9 @ X3) @ (X9 @ X4)))))))), file('/export/starexec/sandbox/tmp/tmp.BjUFjak5SO/E---3.1_2320.p', cTHM145L_pme)). 41.07/5.61 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a, X4:a, X5:a]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X5))=>(X1 @ X3 @ X5)))&![X6:a > $o]:((![X7:a]:((![X8:a]:(((X6 @ X8)=>(X1 @ X8 @ X7)))=>(X1 @ (X2 @ X6) @ X7)))&![X5:a]:(((X6 @ X5)=>(X1 @ X5 @ (X2 @ X6)))))))=>![X9:a > a]:((![X3:a, X4:a]:(((X1 @ X3 @ X4)=>(X1 @ (X9 @ X3) @ (X9 @ X4))))=>?[X10:a]:(((X1 @ (X9 @ X10) @ X10)&(X1 @ X10 @ (X9 @ X10))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145L_pme])])). 41.07/5.61 thf(c_0_2, negated_conjecture, ![X26:a, X27:a, X28:a, X29:a > $o, X30:a, X32:a, X34:a, X35:a, X36:a]:((((~(epred1_0 @ X26 @ X27)|~(epred1_0 @ X27 @ X28)|(epred1_0 @ X26 @ X28))&((((X29 @ (esk2_2 @ X29 @ X30))|(epred1_0 @ (esk1_0 @ X29) @ X30))&(~(epred1_0 @ (esk2_2 @ X29 @ X30) @ X30)|(epred1_0 @ (esk1_0 @ X29) @ X30)))&(~(X29 @ X32)|(epred1_0 @ X32 @ (esk1_0 @ X29)))))&((~(epred1_0 @ X34 @ X35)|(epred1_0 @ (esk3_0 @ X34) @ (esk3_0 @ X35)))&(~(epred1_0 @ (esk3_0 @ X36) @ X36)|~(epred1_0 @ X36 @ (esk3_0 @ X36)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 41.07/5.61 thf(c_0_3, negated_conjecture, ![X3:a, X4:a, X5:a]:(((epred1_0 @ X3 @ X5)|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.07/5.61 thf(c_0_4, negated_conjecture, ![X3:a, X4:a]:(((epred1_0 @ (esk3_0 @ X3) @ (esk3_0 @ X4))|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.07/5.61 thf(c_0_5, negated_conjecture, ![X3:a, X5:a, X4:a]:(((epred1_0 @ X3 @ (esk3_0 @ X4))|~((epred1_0 @ X3 @ (esk3_0 @ X5)))|~((epred1_0 @ X5 @ X4)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 41.07/5.61 thf(c_0_6, negated_conjecture, ![X6:a > $o, X3:a]:(((X6 @ (esk2_2 @ X6 @ X3))|(epred1_0 @ (esk1_0 @ X6) @ X3))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.07/5.61 thf(c_0_7, negated_conjecture, ![X6:a > $o, X3:a]:(((epred1_0 @ X3 @ (esk1_0 @ X6))|~((X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.07/5.61 thf(c_0_8, negated_conjecture, ![X3:a, X20:a > a, X9:a > a, X4:a]:(((epred1_0 @ (X9 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X20 @ Z0))))) @ X3)) @ (esk3_0 @ X4))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X20 @ Z0)))))) @ X3)|~((epred1_0 @ (X20 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X20 @ Z0))))) @ X3)) @ X4)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 41.07/5.61 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X3:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0))) @ X3) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))) @ X3))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 41.07/5.61 thf(c_0_10, negated_conjecture, ![X6:a > $o, X3:a]:(((epred1_0 @ (esk1_0 @ X6) @ X3)|~((epred1_0 @ (esk2_2 @ X6 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.07/5.61 thf(c_0_11, negated_conjecture, ![X3:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X3) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X3))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 41.07/5.61 thf(c_0_12, negated_conjecture, ![X9:a > a, X3:a]:(((epred1_0 @ (esk3_0 @ X3) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X9 @ Z0)))))))|~((epred1_0 @ X3 @ (X9 @ (esk3_0 @ X3)))))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 41.07/5.61 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 41.07/5.61 thf(c_0_14, negated_conjecture, ![X3:a]:((~((epred1_0 @ (esk3_0 @ X3) @ X3))|~((epred1_0 @ X3 @ (esk3_0 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.07/5.61 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 41.07/5.61 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 41.07/5.61 # SZS output end CNFRefutation 41.07/5.61 # Parsed axioms : 2 41.07/5.61 # Removed by relevancy pruning/SinE : 1 41.07/5.61 # Initial clauses : 6 41.07/5.61 # Removed in clause preprocessing : 0 41.07/5.61 # Initial clauses in saturation : 6 41.07/5.61 # Processed clauses : 865 41.07/5.61 # ...of these trivial : 128 41.07/5.61 # ...subsumed : 272 41.07/5.61 # ...remaining for further processing : 465 41.07/5.61 # Other redundant clauses eliminated : 0 41.07/5.61 # Clauses deleted for lack of memory : 0 41.07/5.61 # Backward-subsumed : 29 41.07/5.61 # Backward-rewritten : 47 41.07/5.61 # Generated clauses : 48580 41.07/5.61 # ...of the previous two non-redundant : 41700 41.07/5.61 # ...aggressively subsumed : 0 41.07/5.61 # Contextual simplify-reflections : 0 41.07/5.61 # Paramodulations : 48396 41.07/5.61 # Factorizations : 183 41.07/5.61 # NegExts : 0 41.07/5.61 # Equation resolutions : 1 41.07/5.61 # Disequality decompositions : 0 41.07/5.61 # Total rewrite steps : 7285 41.07/5.61 # ...of those cached : 6320 41.07/5.61 # Propositional unsat checks : 0 41.07/5.61 # Propositional check models : 0 41.07/5.61 # Propositional check unsatisfiable : 0 41.07/5.61 # Propositional clauses : 0 41.07/5.61 # Propositional clauses after purity: 0 41.07/5.61 # Propositional unsat core size : 0 41.07/5.61 # Propositional preprocessing time : 0.000 41.07/5.61 # Propositional encoding time : 0.000 41.07/5.61 # Propositional solver time : 0.000 41.07/5.61 # Success case prop preproc time : 0.000 41.07/5.61 # Success case prop encoding time : 0.000 41.07/5.61 # Success case prop solver time : 0.000 41.07/5.61 # Current number of processed clauses : 383 41.07/5.61 # Positive orientable unit clauses : 92 41.07/5.61 # Positive unorientable unit clauses: 0 41.07/5.61 # Negative unit clauses : 15 41.07/5.61 # Non-unit-clauses : 276 41.07/5.61 # Current number of unprocessed clauses: 40342 41.07/5.61 # ...number of literals in the above : 125900 41.07/5.61 # Current number of archived formulas : 0 41.07/5.61 # Current number of archived clauses : 82 41.07/5.61 # Clause-clause subsumption calls (NU) : 11966 41.07/5.61 # Rec. Clause-clause subsumption calls : 10032 41.07/5.61 # Non-unit clause-clause subsumptions : 293 41.07/5.61 # Unit Clause-clause subsumption calls : 2671 41.07/5.61 # Rewrite failures with RHS unbound : 0 41.07/5.61 # BW rewrite match attempts : 2202 41.07/5.61 # BW rewrite match successes : 57 41.07/5.61 # Condensation attempts : 865 41.07/5.61 # Condensation successes : 9 41.07/5.61 # Termbank termtop insertions : 12460715 41.07/5.61 # Search garbage collected termcells : 387 41.07/5.61 41.07/5.61 # ------------------------------------------------- 41.07/5.61 # User time : 4.993 s 41.07/5.61 # System time : 0.196 s 41.07/5.61 # Total time : 5.188 s 41.07/5.61 # Maximum resident set size: 1752 pages 41.07/5.61 41.07/5.61 # ------------------------------------------------- 41.07/5.61 # User time : 4.993 s 41.07/5.61 # System time : 0.198 s 41.07/5.61 # Total time : 5.191 s 41.07/5.61 # Maximum resident set size: 1740 pages 41.07/5.61 % E exiting 41.07/5.61 % E exiting 41.07/5.61 EOF